Learning Causal Graph: A Genetic Programming Approach
نویسندگان
چکیده
منابع مشابه
Genetic Programming and Deductive-Inductive Learning: A Multi-Strategy Approach
Genetic Programming (GP) is a machine learning technique that was not conceived to use domain knowledge for generating new candidate solutions. It has been shown that GP can beneet from domain knowledge obtained by other machine learning methods with more powerful heuristics. However, it is not obvious that a combination of GP and a knowledge intensive machine learning method can work better th...
متن کاملA Copositive Programming Approach to Graph Partitioning
We consider 3-partitioning the vertices of a graph into sets S1, S2 and S3 of specified cardinalities, such that the total weight of all edges joining S1 and S2 is minimized. This problem is closely related to several NP-hard problems like determining the bandwidth or finding a vertex separator in a graph. We show that this problem can be formulated as a linear program over the cone of complete...
متن کاملBankruptcy Prediction: Dynamic Geometric Genetic Programming (DGGP) Approach
In this paper, a new Dynamic Geometric Genetic Programming (DGGP) technique is applied to empirical analysis of financial ratios and bankruptcy prediction. Financial ratios are indeed desirable for prediction of corporate bankruptcy and identification of firms’ impending failure for investors, creditors, borrowing firms, and governments. By the time, several methods have been attempted in...
متن کاملA Bayesian Approach to Learning Causal Networks
Whereas acausal Bayesian networks represent probabilistic independence, causal Bayesian networks represent causal relationships. In this paper, we examine Bayesian methods for learning both types of networks. Bayesian methods for learning acausal networks are fairly well developed. These methods often employ assumptions to facilitate the construction of priors, including the assumptions of para...
متن کاملAn Integer Programming Approach to Inductive Learning Using Genetic Algorithm
We propose an improved inductive learning method to derive classification rules that correctly describe most of the examples belonging to a class and do not describe most of the examples not belonging to this class. The problem is represented as a modification of the set covering problems solved by a genetic algorithm. The results are very encouraging.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Machine Learning and Computing
سال: 2014
ISSN: 2010-3700
DOI: 10.7763/ijmlc.2014.v4.419